Compressing Optimal Paths with Run Length Encoding
نویسندگان
چکیده
منابع مشابه
Compressing Optimal Paths with Run Length Encoding
We introduce a novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows an...
متن کاملComplexity Results for Compressing Optimal Paths
In this work we give a first tractability analysis of Compressed Path Databases, space efficient oracles used to very quickly identify the first arc on a shortest path. We study the complexity of computing an optimal compressed path database for general directed and undirected graphs. We find that in both cases the problem is NP-complete. We also show that, for graphs which can be decomposed al...
متن کاملRun-length Encoding on Graphics Hardware
In this report, we present a series of improvements to the basic run-length encoding algorithm. Several modified algorithms are generated, from basic CPU single-threaded compression to a highly parallelized version on NVidia CUDA hardware. We also investigated changes to memory access locality in the parallel versions. With a comparison of the various compression times and their corresponding d...
متن کاملAsymptotic Analysis of Run-Length Encoding
Gallager and Van Voorhis have found optimal prefix-free codes κ(K) for a random variable K that is geometrically distributed: Pr[K = k] = p(1 − p) for k ≥ 0. We determine the asymptotic behavior of the expected length Ex[#κ(K)] of these codes as p → 0: Ex[#κ(K)] = log2 1 p + log2 log 2 + 2 + f ( log2 1 p + log2 log 2 )
متن کاملRun-length Encoding for Volumetric Texture
With the dramatic increase of 3D imaging techniques, there is a great demand for new approaches in texture analysis of volumetric data. In this paper, we present a new approach for volumetric texture analysis using a runlength encoding matrix and its texture descriptors. We experiment with our approach on the volumetric data generated from two normal Computed Tomography (CT) studies of the ches...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2015
ISSN: 1076-9757
DOI: 10.1613/jair.4931